Splines via dynamic programming
نویسندگان
چکیده
منابع مشابه
Dynamic Programming via
Dynamic programming is an important algorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubproblems. While a straightforward recursive program solves common subsubproblems repeatedly and often takes exponential time, a dynamic programming algorithm solves every subsubproblem just once, saves the result, reuses it when...
متن کاملConstrained Interpolation via Cubic Hermite Splines
Introduction In industrial designing and manufacturing, it is often required to generate a smooth function approximating a given set of data which preserves certain shape properties of the data such as positivity, monotonicity, or convexity, that is, a smooth shape preserving approximation. It is assumed here that the data is sufficiently accurate to warrant interpolation, rather than least ...
متن کاملOn Approximate Dynamic Programming with Multivariate Splines for Adaptive Control
We define a SDP framework based on the RLS TD algorithm and multivariate simplex B-splines. We introduce a local forget factor capable of preserving the continuity of the simplex splines. This local forget factor is integrated with the RLS TD algorithm, resulting in a modified RLS TD algorithm that is capable of tracking time-varying systems. We present the results of two numerical experiments,...
متن کاملApproximate Dynamic Programming via Linear Programming
The curse of dimensionality gives rise to prohibitive computational requirements that render infeasible the exact solution of largescale stochastic control problems. We study an efficient method based on linear programming for approximating solutions to such problems. The approach "fits" a linear combination of preselected basis functions to the dynamic programming costtogo function. We develop...
متن کاملRobust dynamic programming via multi-parametric programming
In this work, we present a new algorithm for solving complex multi-stage optimisation problems involving hard constraints and uncertainties, based on dynamic and multi-parametric programming. Each echelon of the dynamic programming procedure, typically employed in the context of multi-stage optimisation models, is interpreted as a robust multi-parametric optimisation problem, with the present s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1972
ISSN: 0022-247X
DOI: 10.1016/0022-247x(72)90105-9